The lock-free k-LSM relaxed priority queue
نویسندگان
چکیده
منابع مشابه
CBPQ: High Performance Lock-Free Priority Queue
Priority queues are an important algorithmic component and are ubiquitous in systems and software. With the rapid deployment of parallel platforms, concurrent versions of priority queues are becoming increasingly important. In this paper, we present a novel concurrent lock-free linearizable algorithm for priority queues that scales significantly better than all known (lock-based or lock-free) p...
متن کاملLOLCAT: Relaxed Linear References for Lock-free Programming1 Extended version
A linear reference is a reference guaranteed to be unaliased. This is a powerful property that simplifies reasoning about programs, but is also a property that is too strong for certain applications. For example, lock-free algorithms, which implement protocols to ensure safe concurrent access to data structures, are generally not typable with linear references as they involve sharing of mutable...
متن کاملRelaxed Linear References for Lock-free Data Structures
Linear references are guaranteed to be free from aliases. This is a strong property that simplifies reasoning about programs and enables powerful optimisations, but it is also a property that is too strong for many applications. Notably, lock-free algorithms, which implement protocols that ensure safe, non-blocking concurrent access to data structures, are generally not typable with linear refe...
متن کاملOwnership of a queue for practical lock-free scheduling
We consider the problem of scheduling tasks in a multiprocessor. Tasks cannot always be scheduled independently – for example, only one task associated with a particular object can be run at once. How can a scheduler decide which tasks to run under this constraint? We describe a novel OwnerQueue data structure, a single-dequeuer lockfree queues which allow for the smooth handoff of dequeuing pr...
متن کاملSnapQueue: lock-free queue with constant time snapshots
We introduce SnapQueues concurrent, lock-free queues with a linearizable, lock-free global-state transition operation. This transition operation can atomically switch between arbitrary SnapQueue states, and is used by enqueue, dequeue, snapshot and concatenation operations. We show that implementing these operations efficiently depends on the persistent data structure at the core of the SnapQue...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2015
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2858788.2688547